- iterative methods for linear systems
- итерационные методы решения системы линейных уравнений
Англо-русский словарь по вычислительной технике и информационным технологиям - 4-е изд.. Сергей Орлов .
iterative methods for linear systems
Смотреть что такое "iterative methods for linear systems" в других словарях:
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Iterative method — In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. A specific implementation of an iterative method, including the termination… … Wikipedia
Iterative Template Library — The Iterative Template Library (ITL) is a generic component library that provides iterative methods for solving linear systems. ITL also provides numerous preconditioners which is for MTL. The ITL was written at the Open Systems Lab of Indiana… … Wikipedia
Linear-quadratic regulator — The theory of optimal control is concerned with operating a dynamic system at minimum cost. The case where the system dynamics are described by a set of linear differential equations and the cost is described by a quadratic functional is called… … Wikipedia
System of linear equations — In mathematics, a system of linear equations (or linear system) is a collection of linear equations involving the same set of variables. For example,:egin{alignat}{7}3x ; + ; 2y ; ; z ; = ; 1 2x ; ; 2y ; + ; 4z ; = ; 2 x ; + ; frac{1}{2} y ; ; z … Wikipedia
Matrix-free methods — In computational mathematics, a matrix free method is an algorithm for solving a linear system of equations or an eigenvalue problem that does not store the coefficient matrix explicitly, but accesses the matrix by evaluating matrix vector… … Wikipedia
Domain decomposition methods — Domain dec … Wikipedia
Relaxation (approximation) — In mathematical optimization and related fields, relaxation is a modeling strategy. A relaxation is an approximation of a difficult problem by a nearby problem that is easier to solve. A solution of the relaxed problem provides information about… … Wikipedia
GMRES — Das GMRES Verfahren (für Generalized minimal residual method) ist ein iteratives numerisches Verfahren zur Lösung großer, dünnbesetzter linearer Gleichungssysteme. Das Verfahren ist aus der Klasse der Krylow Unterraum Verfahren und insbesondere… … Deutsch Wikipedia
GMRES-Verfahren — Das GMRES Verfahren (für Generalized minimal residual method) ist ein iteratives numerisches Verfahren zur Lösung großer, dünnbesetzter linearer Gleichungssysteme. Das Verfahren ist aus der Klasse der Krylow Unterraum Verfahren und insbesondere… … Deutsch Wikipedia
CG-Verfahren — Ein Vergleich des einfachen Gradientenverfahren mit optimaler Schrittlänge (in grün) mit dem CG Verfahren (in rot) für die Minimierung der quadratischen Form eines gegebenen linearen Gleichungssystems. CG konvergiert nach 2 Schritten, die Größe… … Deutsch Wikipedia
